Groups possessing extensive hierarchical decompositions
نویسندگان
چکیده
منابع مشابه
Partial differential equations possessing Frobenius integrable decompositions
Frobenius integrable decompositions are introduced for partial differential equations. A procedure is provided for determining a class of partial differential equations of polynomial type, which possess specified Frobenius integrable decompositions. Two concrete examples with logarithmic derivative Bäcklund transformations are given, and the presented partial differential equations are transfor...
متن کاملReduced decompositions in Weyl groups
Let R be a root system with fixed basis ~' and let W be its Weyl group. For every element w ~ W, there exists a natural correspondence between reduced decompositions of w and some linear orders of the set of inversions of w. We study combinatorial properties of these orders. Furthermore, in the case of a symmetric group, for any permutation w we construct a linear action of the symmetric group ...
متن کاملVisual Decompositions of Coxeter Groups
A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W . A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions of a Coxeter group having special factors and special amalgamated subgroup are easily recognized from the presentation of the Coxeter group. If a Coxeter gr...
متن کاملLearning Image Decompositions with Hierarchical Sparse Coding
We present a hierarchical model that learns image decompositions via alternating layers of convolutional sparse coding and max pooling. When trained on natural images, the layers of our model capture image information in a variety of forms: low-level edges, mid-level edge junctions, high-level object parts and complete objects. To build our model we rely on a novel inference scheme that ensures...
متن کاملPyramid Decompositions and Hierarchical Motion Compensation
Block-based motion compensation (MC) is a fundamental component of most video compression algorithms; however, the \optimal" full search is computationally expensive and, as a result, fast search methods are preferred. This paper investigates the use of Gaussian and Laplacian pyramids in fast hierarchical MC algorithms. We compare the two types of pyramids as a function of di erent decimation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the London Mathematical Society
سال: 2010
ISSN: 0024-6093
DOI: 10.1112/blms/bdq045